A primal (all-integer) integer programming algorithm
نویسندگان
چکیده
منابع مشابه
A Pseudo Primal - Dual Integer Programming Algorithm *
The Pseudo Primal-Dual Algorithm solves the pure integer programming problem in two stages, systematically violating and restoring dual feasibility while maintaining an all-integer matrix. The algorithm is related to Gomory AlI-fnteger Algorithm and the Young Primal Integer Programming Algorithm, differing from the former in the dual feasible stage by the choice of cuts and pivot variable, and ...
متن کاملA New Foundation for a Simplified Primal Integer Programming Algorithm
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملA primal all-integer algorithm based on irreducible solutions
This paper introduces an exact algorithm for solving integer programs, neither using cutting planes nor enumeration techniques. It is a primal augmentation algorithm that relies on iteratively substituting one column by other columns that correspond to irreducible solutions of certain linear diophantine inequalities. We prove that various versions of our algorithm are finite. It is a major conc...
متن کاملComplexity of Primal Methods in Integer Programming
One common approach to solve optimization problems is the primal method. One starts with a feasible point and then successively produces new feasible solutions with better objective function values until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration, i.e., given a feasible point find an augmenting vector, if one exists. The d...
متن کاملA Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
سال: 1965
ISSN: 0022-4340
DOI: 10.6028/jres.069b.025